A Theory for Valiant’s Matchcircuits
نویسندگان
چکیده
The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse operation, so that for every k, the nonsingular character matrices of k-bit matchgates form a group, extending the recent work of Cai and Choudhary [1] of the same result for the case of k = 2, and that the single and the two-bit matchgates are universal for matchcircuits, answering a question of Valiant [4].
منابع مشابه
A Theory for Valiant's Matchcircuits (Extended Abstract)
The computational function of a matchgate is represented by its character matrix. In this article, we show that all nonsingular character matrices are closed under matrix inverse operation, so that for every k, the nonsingular character matrices of k-bit matchgates form a group, extending the recent work of Cai and Choudhary [1] of the same result for the case of k = 2, and that the single and ...
متن کاملValiant’s Learnability Theory Using Random Sets
. . . . . . . . . . . . . . . . . . v 1 . INTRODUCTION . . . . . . . . . . . . . . . . 1 2 . REVIEW O F VALIANT’S APPROACH . . . . . . . . . . 3 2.1. RANDOM SET FORMALISM . . . . . . . . . . . 3 2.2. VALIANT’S BOOLEAN FORMALISM . . . . . . . . 4 2.3. GENERAL SET FORMALISM . . . . . . . . . . . 5 3 . BOUNDS ON SAMPLE SIZE . . . . . . . . . . . . . 9 3.1. WORST-CASE ANALYSIS . . . . . . . . . . ....
متن کاملJordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation
In Valiant’s matchgate theory, 2-input 2-output matchgates are 4 × 4 matrices that satisfy ten so-called matchgate identities. We prove that the set of all such matchgates (including non-unitary and non-invertible ones) coincides with the topological closure of the set of all matrices obtained as exponentials of linear combinations of the 2-qubit Jordan-Wigner (JW) operators and their quadratic...
متن کاملComputational Bottlenecks for Evolvability
Valiant (2007) proposed a computational model for evolution and suggested that evolvability be studied in the framework of computational learning theory. Feldman (2008) showed that Valiant’s evolution model is equivalent to the correlational statistical query (CSQ) learning model, which is a restricted setting of the statistical query (SQ) model. Evolvability in Valiant’s model has been shown t...
متن کاملValiant's Holant Theorem and Matchgate Tensors
We propose matchgate tensors as a natural and proper language to develop Valiant’s new theory of Holographic Algorithms. We give a treatment of the central theorem in this theory— the Holant Theorem—in terms of matchgate tensors. Some generalizations are presented.
متن کامل